Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System
نویسندگان
چکیده
A partition of x > 0 of the form x = P i 2 i3i with distinct parts is called a double-base expansion of x. Such a representation can be obtained using a greedy approach, assuming one can efficiently compute the largest {2, 3}-integer, i.e., a number of the form 23, less than or equal to x. In order to solve this problem, we propose an algorithm based on continued fractions in the vein of the Ostrowski number system, we prove its correctness and we analyse its complexity. In a second part, we present some experimental results on the length of double-base expansions when only a few iterations of our algorithm are performed.
منابع مشابه
Sturmian graphs and integer representations
In this paper we consider a numeration system, originally due to Ostrowski, based on the continued fraction expansion of a real number α. We prove that this system has deep connections with the Sturmian graph associated with α. We provide several properties of the representations of the natural integers in this system. In particular, we prove that the set of lazy representations of the natural ...
متن کاملOstrowski Numeration Systems, Addition and Finite Automata
We present an elementary three pass algorithm for computing addition in Ostrowski numerations systems. When a is quadratic, addition in the Ostrowski numeration system based on a is recognizable by a finite automaton. We deduce that a subset of X ⊆Nn is definable in (N,+,Va), where Va is the function that maps a natural number x to the smallest denominator of a convergent of a that appears in t...
متن کاملSturmian graphs and integer representations over numeration systems
In this paper we consider a numeration system, originally due to Ostrowski, based on the continued fraction expansion of a real number α. We prove that this system has deep connections with the Sturmian graph associated with α. We provide several properties of the representations of the natural integers in this system. In particular, we prove that the set of lazy representations of the natural ...
متن کاملSturmian numeration systems and decompositions to palindromes
We extend the classical Ostrowski numeration systems, closely related to Sturmian words, by allowing a wider range of coefficients, so that possible representations of a number n better reflect the structure of the associated Sturmian word. In particular, this extended numeration system helps to catch occurrences of palindromes in a characteristic Sturmian words and thus to prove for Sturmian w...
متن کاملOn Lazy Representations and Sturmian Graphs
In this paper we establish a strong relationship between the set of lazy representations and the set of paths in a Sturmian graph associated with a real number α. We prove that for any non-negative integer i the unique path weighted i in the Sturmian graph associated with α represents the lazy representation of i in the Ostrowski numeration system associated with α. Moreover, we provide several...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 11 شماره
صفحات -
تاریخ انتشار 2009